Vandermonde invariance transformation

نویسندگان

  • Tobias Peter Kurpjuhn
  • Michel T. Ivrlac
  • Josef A. Nossek
چکیده

In this article we introduce a novel multiple-input-multiple-output (MIMO) spatial filter (SF) which can be applied as a preprocessing scheme to uniform linear arrays, preserving the Vandermonde structure of the steering vectors while changing the amplitude and the phase gradient of the steering vector in a nonlinear fashion. The new scheme is therefore titled Vandermonde Invariance Transformation. The introduced degrees of freedom due to this preprocessing transformation can be used to beneficially influence the properties of the channel to achieve an enhanced performance of the subsequent signal processing algorithm. 1. INTRODUCTORY MOTIVATION Some years ago the application of antenna arrays has been proposed for mobile communication systems to attain an increase in capacity and interference reduction by additionally exploiting the spatial separation of the mobile users. Using more then one antenna for the receiver and/or sender provokes a noticeable increase of the system performance by achieving antenna gain, enhanced interference cancellation, and also transmitreceive diversity. Exploiting these properties requires the knowledge of the channel. Therefore channel estimation has to be applied to determine the parameters of the channel. These channel estimation schemes work better for higher signal-to-noise ratios (SNR). To this end preprocessing schemes can be applied to the antenna output to amplify the user signal over the noise and interference. The most commonly used structure of an antenna array is the Uniform Linear Array (ULA). In this case M antennas are arranged in a line with equal distance to their neighboring antennas. Assuming L different propagation paths impinging at a ULA with M antennas under the influence of additive, possibly colored noise produces the data model

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices

The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...

متن کامل

Polynomial Bases for Optimal Worst Case Approximation of Nonlinearities

Several identification and control problems present nonlinearities that cannot be neglected and are often approximated by polynomials. In some previous works optimal set of interpolation nodes that minimizes the uncertainties of the approximation have been derived for the Vandermonde base that, however, can lead to ill-conditioned numerical problems. In this paper the conditions under which pol...

متن کامل

PARALIND-based Blind Joint Angle and Delay Estimation for Multipath Signals with Uniform Linear Array

A novel joint angle and delay estimation (JADE) algorithm for multipath signals, based on the PARAllel profiles with LINear Dependencies (PARALIND) model, is proposed. Capitalizing on the structure property of Vandermonde matrices, PARALIND model is proved to be unique. Angle and delay of multiple rays of sources can be estimated by PARALIND decomposition and an ESPRIT-like shift-invariance tec...

متن کامل

Ordered Random Walks

We construct the conditional version of k independent and identically distributed random walks on R given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random walks, the discrete variant of Dyson’s Brownian motions, which have been considered yet only for nearest-neighbor walks on the lattice. Our only assumptions are moment...

متن کامل

2 7 O ct 2 00 6 ORDERED RANDOM WALKS

We construct the conditional version of k independent and identically distributed random walks on R given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random walks, the discrete variant of Dyson’s Brownian motions, which have been considered yet only for nearest-neighbor walks on the lattice. Our only assumptions are moment...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001